Heuristics on pairing-friendly elliptic curves
نویسنده
چکیده
We present a heuristic asymptotic formula as x → ∞ for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree k ≥ 3, with fixed discriminant, with rho-value bounded by a fixed ρ0 such that 1 < ρ0 < 2, and with prime subgroup order at most x.
منابع مشابه
Pairing-friendly Elliptic Curves of Embedding Degree 1 and Applications to Cryptography
Recently, Wang et al. [1] proposed a new method for constructing pairingfriendly elliptic curves of embedding degree 1. Authors claim that this method significantly improves the efficiency of generating elliptic curves. In this paper, we give the arithmetic of pairing-friendly elliptic curves of embedding degree 1. We prove that conventional classification of pairings into Type 1, 2, 3 and 4 is...
متن کاملEffective Polynomial Families for Generating More Pairing-Friendly Elliptic Curves
Finding suitable non-supersingular elliptic curves becomes an important issue for the growing area of pairing-based cryptosystems. For this purpose, many methods have been proposed when embedding degree k and cofactor h are taken different values. In this paper we propose a new method to find pairing-friendly elliptic curves without restrictions on embedding degree k and cofactor h. We propose ...
متن کاملPairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. After Mitsunari, Sakai and Kasahara’s traitor tracing scheme and Boneh and Boyen’s short signature scheme, many protocols based on pairing-related problems such as the q-weak Diffie-Hellman problem have been proposed. In Eu...
متن کاملConstruction of Pairing-Friendly Elliptic Curves
The aim of this paper is to construct pairing friendly elliptic curves. In this paper, we explain a method of finding the polynomials representing √−D and ζk over the field containing √−D and ζk and how to construct a pairing friendly elliptic curves over the cyclotomic fields containing Q(ζk, √−D) for arbitrary k and D by CP method. By using the factorization of the cyclotomic polynomial combi...
متن کاملOn conditions for ρ-value is 1 or not of complete family of pairing-friendly elliptic curves
We study whether a complete family of pairing friendly elliptic curves has a ρ-value 1 or not. We show that, in some cases, ρ-values are not to be 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Mathematical Cryptology
دوره 6 شماره
صفحات -
تاریخ انتشار 2012